package workexp.alg.dp;

import org.junit.Test;

public class Rob {
    public int rob(int[] nums) {
        int[] dp =new int[nums.length];
        if(nums.length<2){
            return nums[0];
        }
        dp[0]=nums[0];
        dp[1]=Math.max(nums[0],nums[1]);
        for (int i = 2; i < nums.length ; i++) {
            dp[i] =Math.max(dp[i-2]+nums[i],dp[i-1]);
        }
        return dp[nums.length-1];
    }

    @Test
    public void test(){
        int[] nums = {0};
        int s = rob(nums);
        System.out.println(s);
    }
}
